Graph Decomposition and Recursive Closures
نویسنده
چکیده
Abstract. In this paper, we propose a new algorithm for computing recursive closures. The main idea behind this is tree labeling and graph decomposition, based on which the transitive closure of a directed graph can be computed in O(e⋅b) time and O(n⋅b) space, where n is the number of the nodes of the graph, e is the numbers of the edges, and b is the graph’s breadth. It is a better computational complexity than any existing algorithms for this problem.
منابع مشابه
A New Algorithm for Transitive Closures and Computation of Recursion in relational Databases
In this paper, we propose a new algorithm for computing recursive closures. The main idea behind this algorithm is tree labeling and graph decomposition, based on which the transitive closure of a directed graph can be computed in O(e⋅dmax⋅dout) time and in O(n⋅dmax⋅dout) space, where n is the number of the nodes of the graph, e is the numbers of the edges, dmax is the maximal indegree of the n...
متن کاملThe eccentric connectivity index of bucket recursive trees
If $G$ is a connected graph with vertex set $V$, then the eccentric connectivity index of $G$, $xi^c(G)$, is defined as $sum_{vin V(G)}deg(v)ecc(v)$ where $deg(v)$ is the degree of a vertex $v$ and $ecc(v)$ is its eccentricity. In this paper we show some convergence in probability and an asymptotic normality based on this index in random bucket recursive trees.
متن کاملA Space-Economic Representation of Transitive Closures in Relational Databases
A composite object represented as a directed graph (digraph for short) is an important data structure that requires efficient support in CAD/CAM, CASE, office systems, software management, web databases, and document databases. It is cumbersome to handle such objects in relational database systems when they involve ancestor-descendant relationships (or say, recursive relationships). In this pap...
متن کاملNumerical solution of fuzzy Hunter-Saxton equation by using Adomian decomposition and Homotopy analysis methods
In this paper, a fuzzy Hunter-Saxton equation is solved by using the Adomian'sdecomposition method (ADM) and homotopy analysis method (HAM). Theapproximation solution of this equation is calculated in the form of series whichits components are computed by applying a recursive relation. The existenceand uniqueness of the solution and the convergence of the proposed methodsare proved. A numerical...
متن کاملDistinct edge geodetic decomposition in graphs
Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003